The Arbitrarily Varying Relay Channel
نویسندگان
چکیده
منابع مشابه
The Arbitrarily Varying Relay Channel
We study the arbitrarily varying relay channel, and establish the cutset bound and partial decode-forward bound on the random code capacity. We further determine the random code capacity for special cases. Then, we consider conditions under which the deterministic code capacity is determined as well. In addition, we consider the arbitrarily varying Gaussian relay channel with sender frequency d...
متن کاملCapacity of the Gaussian arbitrarily varying channel
The Gaussian arbitrarily varying channel with input constraint r and state constraint 2 admits input sequences x = ( x l , , x , ~ ) of real numbers with Cxf 5 nT and state sequences s = ( 5 ,. , T , ~ ) of real numbers with L Y ~ 5 H A ; the output sequence x + s + V , where V = ( VI, , y , ) is a sequence of independent and identically distributed Gaussian random variables with mean 0 and var...
متن کاملClassical-Quantum Arbitrarily Varying Wiretap Channel
The arbitrarily varying channel models transmission over a channel with an state that can change over time. We may interpret it as a channel with an evil jammer. The arbitrarily varying channel was first introduced by Blackwell, Breiman, and Thomasian in [8]. The wiretap channel models communication with security. It was first introduced by Wyner in [12]. We may interpret it as a channel with a...
متن کاملThe capacity of the arbitrarily varying channel revisited: Positivity, constraints
A well-known result of Ahlswede asserts that the determinis-tic code capacity of an arbitrarily varying channel (AVC), under the average error probability criterion, either equals its random code capacity or else is zero. A necessary and sufficient condition is identified for deciding between these alternatives, namely, the capacity is zero if and only if the AVC is symmetrizable. The capacity ...
متن کاملFinite Blocklength and Dispersion Bounds for the Arbitrarily-Varying Channel
Finite blocklength and second-order (dispersion) results are presented for the arbitrarily-varying channel (AVC), a classical model wherein an adversary can transmit arbitrary signals into the channel. A novel finite blocklength achievability bound is presented, roughly analogous to the random coding union bound for non-adversarial channels. This finite blocklength bound, along with a known con...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Entropy
سال: 2019
ISSN: 1099-4300
DOI: 10.3390/e21050516